44 research outputs found
Families of locally separated Hamilton paths
We improve by an exponential factor the lower bound of K¨orner and Muzi for the cardinality of the largest family of Hamilton paths in a complete graph of n vertices in which the union of any two paths has maximum degree 4. The improvement is through an explicit construction while the previous bound was obtained by a greedy algorithm. We solve a similar problem for permutations up to an exponential factor
Degree-doubling graph families
Let G be a family of n-vertex graphs of uniform degree 2 with the property
that the union of any two member graphs has degree four. We determine the
leading term in the asymptotics of the largest cardinality of such a family.
Several analogous problems are discussed.Comment: 9 page
Families of locally separated Hamilton paths
We improve by an exponential factor the lower bound of K¨orner and Muzi for the cardinality of the largest family of Hamilton paths in a complete graph of n vertices in which the union of any two paths has maximum degree 4. The improvement is through an explicit construction while the previous bound was obtained by a greedy algorithm. We solve a similar problem for permutations up to an exponential factor
Zero-error capacity of binary channels with memory
We begin a systematic study of the problem of the zero--error capacity of
noisy binary channels with memory and solve some of the non--trivial cases.Comment: 10 pages. This paper is the revised version of our previous paper
having the same title, published on ArXiV on February 3, 2014. We complete
Theorem 2 of the previous version by showing here that our previous
construction is asymptotically optimal. This proves that the isometric
triangles yield different capacities. The new manuscript differs from the old
one by the addition of one more pag
Graph-different permutations
We strengthen and put in a broader perspective previous results of the first
two authors on colliding permutations. The key to the present approach is a new
non-asymptotic invariant for graphs.Comment: 1+14 page
Families of graph-different Hamilton paths
Let D be an arbitrary subset of the natural numbers. For every n, let M(n;D)
be the maximum of the cardinality of a set of Hamiltonian paths in the complete
graph K_n such that the union of any two paths from the family contains a not
necessarily induced cycle of some length from D. We determine or bound the
asymptotics of M(n;D) in various special cases. This problem is closely related
to that of the permutation capacity of graphs and constitutes a further
extension of the problem area around Shannon capacity. We also discuss how to
generalize our cycle-difference problems and present an example where cycles
are replaced by 4-cliques. These problems are in a natural duality to those of
graph intersection, initiated by Erd\"os, Simonovits and S\'os. The lack of
kernel structure as a natural candidate for optimum makes our problems quite
challenging
On the odd cycles of normal graphs
AbstractA graph is normal if there exists a cross-intersecting pair of set families one of which consists of cliques while the other one consists of stable sets, and furthermore every vertex is obtained as one of these intersections. It is known that perfect graphs are normal while C5, C7, andC̄7 are not. We conjecture that these three graphs are the only minimally not normal graphs. We give sufficient conditions for a graph to be normal and we characterize those normal graphs that are triangle-free
A Better Bound for Locally Thin Set Families
AbstractA family of subsets of an n-set is 4-locally thin if for every quadruple of its members the ground set has at least one element contained in exactly 1 of them. We show that such a family has at most 20.4561n members. This improves on our previous results with Noga Alon. The new proof is based on a more careful analysis of the self-similarity of the graph associated with such set families by the graph entropy bounding technique
On types of growth for graph-different permutations
We consider an infinite graph G whose vertex set is the set of natural
numbers and adjacency depends solely on the difference between vertices. We
study the largest cardinality of a set of permutations of [n] any pair of which
differ somewhere in a pair of adjacent vertices of G and determine it
completely in an interesting special case. We give estimates for other cases
and compare the results in case of complementary graphs. We also explore the
close relationship between our problem and the concept of Shannon capacity
"within a given type".Comment: 14 pages+title pag